A Denotational Model for Probabilistic and Nondeterministic Processes
نویسندگان
چکیده
In this paper we present an algebraic model for the description of probabilistic and nondeterministic processes: PNAL (Probabilistic and Nondeterministic Algebraic Language), an extension of EPL, dee-ned by Matthew Hennessy, including a probabilistic choice operator. An operational semantics and a testing semantics for the language are presented. A denotational semantics for the nite subset of the language, PNAL f , is proposed. Finally, we provide two results: equivalence between nondeterministic processes in nite EPL is preserved in PNAL f , and denotational semantics is fully abstract with respect to the testing semantics.
منابع مشابه
Representing Nondeterministic and Probabilistic Behaviour in Reactive Processes
In this paper we investigate ways of modelling communicating processes that display both nondeterministic and probabilistic behaviour. We present an operational model for a probabilistic version of CSP, and describe a number of ways of abstracting a denotational semantics from such a model, so as to represent a process by a set of probability functions, one function for each way of resolving th...
متن کاملProgramming Research Group Representing Nondeterminism and Probabilistic Behaviour in Reactive Processes Representing Nondeterminism and Probabilistic Behaviour in Reactive Processes
In this paper we describe a way of modelling communicating processes that display both nondeterministic and probabilistic behaviour. We represent processes by nondeterministic, probabilistic, action (NPA) graphs with three sorts of nodes: action nodes, from which the process may evolve by performing visible actions; probabilistic nodes, from which the process may evolve probabilistically; and n...
متن کاملAxioms for Probability and Nondeterminism
This paper studies a simple calculus for finite-state processes featuring both nondeterministic and probabilistic choice. We present a domain model and an operational semantics for our calculus. The denotational model uses the probabilistic powerdomain of Jones and Plotkin, combined with a geometrically convex variant of the Plotkin powerdomain. The operational model defines transition rules un...
متن کاملCompositional Testing Preorders for Probabilistic Processes
Transition systems are well-established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for reenement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic s...
متن کاملProbabilistic Extensions of Process Algebras ?
In this chapter, we adopt Probabilistic Transition Systems as a basic model for probabilistic processes, in which probabilistic and nondeter-ministic choices are independent concepts. The model is essentially a nondeterministic version of Markov decision processes or probabilistic automata of Rabin. We develop a general framework to deene proba-bilistic process languages to describe probabilist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000